Method and system for correcting the spelling of misspelled words

ABSTRACT

The present invention provides a method and system for correcting the spelling of words. In a preferred embodiment, a list of misspelled words and associated correctly spelled words is maintained. When a misspelled word is encountered during the spell checking of a word processing document, the system searches the list for the misspelled word. If the misspelled word is in the list, the system replaces the word in the document with the associated correctly spelled word. The system also provides a method and system for adding misspelled words and associated correctly spelled words to the list.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a Continuation of U.S. Pat. application Ser. No. 07/525,405, filed May 18, 1990, allowed on Feb. 18, 1997, now U.S. Pat. No. 5,604,897.

TECHNICAL FIELD

This invention relates generally to computer word processing systems and particularly to a method and system for remembering and correcting misspelled words.

BACKGROUND OF THE INVENTION

A primary use of computers, especially personal computers, is "word processing." Word processors have replaced the typewriter as a principal means for document production. A word processor allows a user to input the text of a document, such as a letter, into a computer. Once the document is in the computer the user can make revisions to it. For example, paragraphs can be easily moved around, misspelled words can be corrected, and words can be deleted. Finally, the document can be printed out or can be stored in the computer for retrieval and updating at a later date. One such word processor is Microsoft Corporation's WORD.

In producing documents, it is typically very important that each word in the document be spelled correctly. In manual word processing systems (e.g., the typewriter), the only way to check the spelling is to manually review the document after it is typed. In computer word processors, a spell checking program (spell checker) is often used to check the spelling of the words in a document. A spell checker has an associated dictionary file that contains a list of correctly spelled words. To check the spelling of a word in the document, the spell checker searches the dictionary for that word. If the word is in the dictionary, then the word is correctly spelled. Otherwise, the word is misspelled. (Since a dictionary will not contain every possible word, e.g., last names, it may be that the word is correctly spelled but not in the dictionary.) The spell checker typically reports the misspelling to the user and prompts for the correct spelling. The spell checker then replaces the misspelled word with the correctly spelled word.

The typical spell checker also allows the user to add words to the dictionary. For example, the dictionary may not include terms that are used in specialized fields, such as medicine or law.

A common problem in the entry of words occurs when a word is consistently misspelled in the same way. For example, the user may type "teh" rather than "the." Or the user may type "supercede" rather than "supersede." A typical spell checker will detect each misspelling and give the user a chance to correct it. However, the next time the user misspells in the same way, he must reenter the correct spelling. This continual need for correction is undesirable. It would be desirable to have a spell checker in which these misspellings could be automatically corrected.

SUMMARY OF THE INVENTION

It is an object of the present invention to provide a improved spell checker for a word processing system or the like in which commonly misspelled words are automatically corrected.

It is another object of the present invention to provide an improved spell checker for a word processing system or the like in which the user can designate common misspellings and associated correct spellings.

These and other objects of the present invention, which will become more apparent as the invention is described more fully below, are obtained by providing an improved method and system for correcting the spelling of words in a document. In a preferred embodiment, a word processing system maintains a "corrected before" file, which contains a list of misspelled words and associated correctly spelled words. The system provides for retrieving a misspelled word from the word processing document, determining whether the retrieved misspelled word is in the corrected before file as a misspelled word, and if the retrieved misspelled word is in the corrected before file, retrieving the associated correctly spelled word from the corrected before file and automatically replacing the misspelled word in the document with the retrieved associated correctly spelled word to effect the correction of the spelling.

In a preferred embodiment of the present invention, a word processing system provides a system for inputting a correctly spelled word from a user and storing the corresponding misspelled word and the correctly spelled word in the corrected before file.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram which illustrates the processing units of a preferred embodiment of the present invention.

FIG. 2 is a flow diagram of spell checker program that implements a preferred embodiment of the present invention.

FIG. 3 shows variables used in the pseudo code of Table 1.

FIG. 4 shows the format of the corrected before file in a preferred embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention provides a method and system for correcting the spelling of misspelled words in a computer system. In a preferred embodiment, the present invention is part of a spell checking program, which may itself be part of a word processor. A file that contains a list of misspelled words and associated correctly spelled words is known as the "corrected before" file. When the spell checker encounters a misspelled word during the spell checking of a document, the system searches the corrected before file for the misspelled word. If found, the system, in a preferred embodiment, automatically replaces the misspelled word in the document with the correctly spelled word. A preferred embodiment also allows the user of the spell checker to add misspelled words and associated correctly spelled words to the corrected before file.

FIG. 1 is a block diagram which illustrates the processing units of a preferred embodiment of the present invention. The word processing document 10, the dictionary file 14, and the corrected before file 15 reside in computer memory during spell checking. The word processing document 10 contains a list of words. A word can be defined as a string of characters delimited by a blank or a punctuation mark. In a preferred embodiment, the characters are stored in American Standard Code for Information Interchange (ASCII) format. The dictionary file 14 also contains a list of words. Any of the well-known dictionary storage and access techniques can be used with the present invention. The corrected before file 15 contains a list of misspelled words and the associated correctly spelled words. In a preferred embodiment, each pair of misspelled and associated correctly spelled words is delimited by an end of line character.

The processing units 11, 12, 13 use the word processing document 10, the dictionary file 14, and the corrected before file 15 as input to correct the spelling of words that are misspelled with a consistent misspelling. The find misspelled word unit 11 successively fetches words from the word processing document 10. The find misspelled word unit 11 then reads the dictionary file 14 to determine if the word is in the dictionary. If the word is not in the dictionary, then it is assumed to be misspelled. If the word is misspelled, then a pointer to the misspelled word is passed to the check corrected before file unit 12.

The check corrected before file unit 12 receives the pointer to the misspelled word from the find misspelled word unit 11. The check corrected before file unit 12 reads the corrected before file 15 to determine if the file contains the misspelled word. If the misspelled word is in the corrected before file 15, then the check corrected before file unit 12 sends a pointer to the misspelled word in the word processing document 10 and a pointer to the associated correctly spelled word to the correct spelling unit 13.

The correct spelling unit 13 receives the pointers and replaces the misspelled word in the word processing document 10 with the correctly spelled word to complete the correction.

FIG. 2 is a flow diagram of a spell checker program that implements a preferred embodiment of the present invention. The input to the spell checker is a document to be checked, a dictionary file, a corrected before file, a correctly spelled word from the user, and an indicator whether the correctly spelled word should be stored in the corrected before file. The spell checker fetches each word from the document or from a portion of the document until all the words have been processed. For each word fetched, the spell checker determines if the word is in the dictionary. If the word is in the dictionary, then the spell checker fetches the next word. If the word is not in the dictionary, the spell checker determines if the word is in the corrected before file as a misspelled word. If the word is in the corrected before file, the spell checker replaces the misspelled word in the document with the correct spelling and fetches the next word. If the word is not in the corrected before file, the spell checker prompts the user for the correct spelling and asks whether the correction should be stored in the corrected before file. If the user indicates that the correction should be stored, then the spell checker stores the misspelled word and the correctly spelled word into the file. Then the spell checker corrects the misspelling in the document and fetches the next word.

In block 201, the spell checker fetches the next word from the document. In block 202, if all the words in the document have already been fetched, then the spell checking is done, else the spell checker continues at block 203. In block 203, the spell checker determines whether the fetched word is in the dictionary. The techniques for storing a dictionary and determining whether a word is in the dictionary are well known. In block 204, if the fetched word is in the dictionary, then the spelling is correct and the spell checker loops to block 201 to fetch the next word, else the spell checker continues at block 205. In block 205, the spell checker searches the corrected before file to determine whether the fetched word is in the file as a misspelled word, and retrieves the associated correctly spelled word. In block 206, if the fetched word is in the corrected before file as a misspelled word, then the spell checker continues at block 207, else the spell checker continues at block 208.

In block 207, the spell checker replaces the misspelled word in the document with the correctly spelled word and loops to block 201 to fetch the next word.

In block 208, the spell checker displays the misspelled word to the user and prompts the user with a list of options, such as, to correct the spelling, to assume the spelling is correct, or to add the spelling to the dictionary. In many existing systems, the user is presented with a list of possible correct spellings from the dictionary file that the user may select to replace the misspelled word. In block 209, if the user selects the option to correct the misspelled word, then the spell checker continues at block 211, else the spell checker continues at block 210. In block 210, the spell checker processes the other options and loops to block 201 to fetch the next word.

In block 211, the spell checker prompts the user to input the correct spelling for the fetched word and to indicate whether the correction should be added to the corrected before file. In block 212, if the user indicates that the correction should not be added to the corrected before file, then the spell checker continues at block 207 to correct the misspelling, else in block 213 the spell checker adds the fetched word and the correctly spelled word to the corrected before file and continues at block 207 to correct the misspelling. In a preferred embodiment, the fetched word and correctly spelled word pair is appended to the end of the corrected before file.

Table 1 is Pascal-like pseudo code illustrating an embodiment of the present invention. The main procedure, named "Proof," spell checks a document. FIG. 3 shows the variables used in procedure Proof. The input parameters are frst₋₋ ptr and lst₋₋ ptr, which point to the first and last character in the document, respectively. Procedure Proof updates the variable lst₋₋ ptr to accommodate differences in the length of a misspelled word and the associated correctly spelled word. The variables cur₋₋ ptr and nxt₋₋ ptr point to the word being spell checked and to the character after that word, respectively. The string variables cur₋₋ word and correct₋₋ word contain the word being spell checked and the correctly spelled word, respectively. In the pseudo code, the string type is an array of characters that can be of variable length. The function named "length" returns the number of characters in a string.

Referring now to the pseudo code for procedure Proof, the while loop, which controls the processing, terminates when cur₋₋ ptr is greater than lst₋₋ ptr, that is, when all the characters have been processed. The variable cur₋₋ ptr points to the character in the document being processed. Procedure FetchNextWord inputs cur₋₋ ptr, determines the next word in the document, returns the word in cur₋₋ word, and updates cur₋₋ ptr. Procedure Proof then sets nxt_ptr to the next character in the document after the current word. Procedure Proof then invokes function Verif with parameter cur₋₋ word. Function Verif determines whether the word is in the dictionary. If the word is in the dictionary, then function Verif returns a value of true, else it returns a value of false. If the word is in the dictionary, then procedure Proof updates cur₋₋ ptr to point to the next character and loops to the beginning of the while loop.

If the word is not in the dictionary, then procedure Proof invokes function Search₋₋ CBF. Function Search₋₋ CBF determines whether the passed word is in the corrected before file. If the word is in the file, then function Search₋₋ CBF returns with a value of true and the correct spelling in variable correct₋₋ word. If the word is in the file, then procedure Proof replaces the incorrect spelling in the document with the correct spelling by invoking procedure CorrectMisspelling, updates cur₋₋ ptr to point to the next character, and loops to the beginning of the while loop.

If the word is not in the corrected before file, then procedure Proof invokes procedure GetOption. In a preferred embodiment, the options include "correct," "add," and "ignore." Where "correct" means to correct the spelling, "add" means to add the word to the dictionary, and "ignore" means to assume the spelling is correct. The pseudo code shows the processing for the "correct" option. Procedure Proof invokes procedure InputCorrection. Procedure InputCorrection displays the incorrectly spelled word, prompts the user to input the correct spelling, and asks the user whether to save the correction in the corrected before file. If the user indicates that the correction is to be saved, then procedure Proof invokes procedure AddTo₋₋ CBF to store the incorrect and correct spelling into the corrected before file. FIG. 4 shows the format of a preferred embodiment of the corrected before file. Procedure Proof then invokes procedure CorrectMisspelling to replace the incorrect spelling in the document. The procedure then adjusts the variable nxt₋₋ ptr to account for the length of the correctly spelled word, sets cur₋₋ ptr, and loops to the beginning of the while loop.

Procedure FetchNextWord starts at cur₋₋ ptr and searches for the next word and returns it in cur₋₋ word. The variable cur₋₋ ptr is set to point to the first character of the word. The procedure first searches for a non-delimiting character, which indicates the start of a word. The procedure then stores the following characters into cur₋₋ word until a delimiter or the end of document is encountered.

The function Search₋₋ CBF searches the corrected before file for the incorrectly spelled cur₋₋ word. If cur₋₋ word is in the file, function Search₋₋ CBF returns a value of true, else it returns a value of false. Each entry in the file is in the format containing the following: incorrect spelling, "→", correct spelling, and end of line character. Function Search₋₋ CBF inputs a line at a time and invokes procedure Parse to retrieve the incorrect and correct spelling. Although the pseudo code indicates that the function opens and closes the corrected before file each time it is invoked, one skilled in the art would know of programming techniques for obviating an open and a close on each invocation.

Procedure AddTo₋₋ CBF adds a record to the corrected before file.

Procedure CorrectMisspelling replaces the misspelled word in the document with the correctly spelled word. The procedure adjusts the variable lst₋₋ ptr to account for a difference in length of incorrectly spelled word and correctly speled word, which changes the length of a document. If the spellings have different lengths, then the document size is adjusted and the characters in the document after the correction must be moved. The procedure then inserts the correction.

                  TABLE 1                                                          ______________________________________                                         PROCEDURE Proof(frst.sub.-- ptr :  CHAR, VAR 1st.sub.-- tr :  CHAR);           TYPE                                                                           STRING = ARRAY  1..n!OF CHAR;                                                  {a variable length array}                                                      VAR                                                                            cur.sub.-- ptr, nxt.sub.-- ptr : A CHAR                                        cur.sub.-- word, correct.sub.-- word : STRING;                                 save.sub.-- flag : BOOLEAN;                                                    PROCEDURE FetchNextword                                                        (VAR cur.sub.-- ptr :  CHAR,                                                   VAR cur.sub.-- word : STRING);                                                 VAR                                                                            ptr :  CHAR;                                                                   BEGIN                                                                          WHILE ((cur.sub.-- ptr in  " ",".",";", . . . !) (delimiters}                  AND cur.sub.-- ptr <=1st.sub.-- ptr) DO                                        cur.sub.-- ptr :=cur.sub.-- ptr + 1;                                           cur.sub.-- word :=null.sub.-- string;                                          ptr :=cur.sub.-- ptr;                                                          WHILE (NOT(ptr  in  " ",".",";", . . . !)                                      AND ptr <= 1st.sub.-- ptr) DO                                                  BEGIN                                                                          cur.sub.-- word :=Concat(cur.sub.-- word, ptr )                                ptr := ptr + 1;                                                                END;                                                                           END; {FetchNextword}                                                           FUNCTION Search.sub.-- CBF                                                     (cur.sub.-- word : STRING,                                                     VAR correct.sub.-- word : STRING) : BOOLEAN;                                   VAR                                                                            match: BOOLEAN;                                                                line, bad.sub.-- word, good.sub.-- word : STRING;                              (remove page eject)                                                            PROCEDURE Parse;                                                               BEGIN                                                                          i := 1; bad := true;                                                           good.sub.-- word :=null.sub.-- string; bad.sub.-- word :=null.sub.--           string;                                                                        WHILE (line i!<>eol.sub.-- char) DO                                            BEGIN                                                                          IF (bad) THEN                                                                  IF (line i! = blank.sub.-- char) THEN                                          BEGIN                                                                          i := i + 3; {skip over "->")                                                   bad := false;                                                                  END;                                                                           ELSE                                                                           bad.sub.-- word := Concat(bad.sub.-- word, line i!);                           ELSE                                                                           good.sub.-- word := Concat(good.sub.-- word, line i!);                         i := i + 1;                                                                    END;                                                                           END; {Parse}                                                                   BEGIN                                                                          open ("CBF");                                                                  match := false;                                                                WHILE (NOT eof("CBF") AND NOT match) DO                                        BEGIN                                                                          getnextline ("CBF", line);                                                     parse;                                                                         IF (bad.sub.-- word = cur.sub.-- word) THEN                                    BEGIN                                                                          match := true;                                                                 correct.sub.-- word := good.sub.-- word;                                       END;                                                                           Search.sub.-- CBF := match;                                                    close ("CBF");                                                                 END; (Search.sub.-- CBF)                                                       PROCEDURE AddTo.sub.-- CBF (bad.sub.-- word, good.sub.-- word : STRING);       BEGIN                                                                          open ("CBF"); (assume that open positions at end of file)                      write (bad.sub.-- word); write ("->"); writeln (good.sub.-- word);             close ("CBF");                                                                 END;{AddTo.sub.-- CBF}                                                         PROCEDURE CorrectMisspelling                                                   (ptr :  CHAR,                                                                  cur.sub.-- word: STRING,                                                       correct.sub.-- word : STRING);                                                 VAR                                                                            to.sub.-- ptr, from.sub.-- ptr :  CHAR;                                        BEGIN                                                                          IF (length(correct.sub.-- word) < length(cur.sub.-- word)) THEN                BEGIN                                                                          to.sub.-- ptr := ptr + length(correct.sub.-- word);                            from.sub.-- ptr := ptr + length(cur.sub.-- word);                              WHILE (from.sub.-- ptr <= 1st.sub.-- ptr) DO                                   BEGIN                                                                          to.sub.-- ptr := from.sub.-- ptr ;                                             to.sub.-- ptr := to.sub.-- ptr + 1; from.sub.-- ptr := from.sub.-- ptr +       1;                                                                             END;                                                                           END;                                                                           IF (length(correct.sub.-- word) > length(cur.sub.-- word)) THEN                BEGIN                                                                          to.sub.-- ptr:= 1st.sub.-- ptr +                                               (length(correct.sub.-- word) - length(cur.sub.-- word));                       from.sub.-- ptr := 1st.sub.-- ptr;                                             WHILE (from.sub.-- ptr >= ptr + length(cur.sub.-- word)) DO                    BEGIN                                                                          to.sub.-- ptr := from.sub.-- ptr ;                                             to.sub.-- ptr := to.sub.-- ptr - 1; from.sub.-- ptr := from.sub.-- ptr -       END;                                                                           END;                                                                           to.sub.-- ptr := ptr;                                                          FOR i := 1 TO length(correct.sub.-- word) DO                                   BEGIN                                                                          to.sub.-- ptr := correct.sub.-- word i!; to.sub.-- ptr := to.sub.-- ptr +      1;                                                                             END;                                                                           1st.sub.-- ptr := 1st.sub.-- ptr +                                             (length(correct.sub.-- word) - 1ength(cur.sub.-- word))                        END; {CorrectMisspelling}                                                      BEGIN {Proof}                                                                  cur.sub.-- ptr := frst.sub.-- ptr;                                             WHILE (cur.sub.-- ptr <= 1st.sub.-- ptr)                                       BEGIN                                                                          FetchNextword(cur.sub.-- ptr, cur.sub.-- word);                                nxt.sub.-- ptr := cur.sub.-- ptr + length(cur.sub.-- word);                    IF (NOT Verif(cur.sub.-- word)) THEN                                           IF (Search.sub.-- CBF(cur.sub.-- word, correct.sub.-- word)) THEN              BEGIN                                                                          CorrectMisspelling(cur.sub.-- ptr, cur.sub.-- word, correct.sub.--             word);                                                                         nxt.sub.-- ptr := cur.sub.-- ptr + length(correct.sub.-- word);                END;                                                                           ELSE                                                                           BEGIN                                                                          GetOption (option);                                                            CASE option OF                                                                 .                                                                              .                                                                              .                                                                              "correct":                                                                     BEGIN                                                                          InputCorrection                                                                (cur.sub.-- word, correct.sub.-- word,                                         save.sub.-- flag);                                                             If (save.sub.-- f lag) THEN                                                    AddTo.sub.-- CBF(cur.sub.-- word, correct.sub.-- word);                        CorrectMisspelling                                                             (cur.sub.-- ptr, cur.sub.-- word,                                              correct.sub.-- word);                                                          nxt.sub.-- ptr := cur.sub.-- ptr + length(correct.sub.-- word);                END;                                                                           .                                                                              .                                                                              .                                                                              ENDCASE;                                                                       END;                                                                           cur.sub.-- ptr := nxt.sub.-- ptr;                                              END;                                                                           END; {Proof}                                                                   ______________________________________                                    

Although the methods and systems of the present invention have been described in terms of preferred embodiments it is not intended that the invention be limited to these embodiments. Modifications within the spirit of the invention will be apparent to those skilled in the art. It will be apparent to those skilled in the art that the present invention can be used in other than word processing systems. The invention can be used generally in systems where spell checking is performed. The scope of the present invention is defined by the claims that follow. 

I claim:
 1. A method in a computer system for correcting the spelling of words in a plurality of documents, the computer system having a list of misspelled words and associated correctly spelled words, the method comprising:for each of the plurality of documents,for each word in the document,determining whether the word is in the list as a misspelled word; when the word is in the list as a misspelled word, automatically replacing the word with the associated correct spelling from the list when the word is not correctly spelled and is not in the list as a misspelled word,receiving from a user a correct spelling for the word; and adding the misspelled word associated with the received correct spelling for the word to the list; whereby once a misspelled word and received correct spelling is added to the list, the misspelled word is automatically replaced when it occurs in other documents.
 2. The method of claim 1 including determining whether the word is correctly spelled by checking a dictionary.
 3. The method of claim 1 wherein the adding of the misspelled word associated with the received correct spelling for the word to the list occurs only in response to a indication from the user to add the word to the list.
 4. A method in a computer system for creating a list of misspelled words and associated correctly spelled words, the method comprising:retrieving a word from a document; determining whether the retrieved word is correctly spelled; when the retrieved word is not correctly spelled,receiving a correct spelling for the word; and adding the retrieved word and its correct spelling to the list; and for each other occurrence of the same retrieved word in the document, automatically replacing the occurrence with the received correct spelling.
 5. The method of claim 4 includingdetermining whether the retrieved word is in the list as a misspelled word; and when the retrieved word is in the list as a misspelled word, replacing the retrieved word in the document with the associated correctly spelled word from the list.
 6. The method of claim 5 wherein the receiving of the correct spelling for the word and the adding of the retrieved word and its correct spelling to the list occurs when the word is not in the list as a misspelled word.
 7. The method of claim 4 including replacing the retrieved word with the received correct spelling.
 8. A method in a computer system for creating a list of misspelled words and associated correctly spelled words, the method comprising:retrieving a plurality of words from a document; determining whether each of the plurality of retrieved words is correctly spelled; and when a retrieved word is not correctly spelled,receiving a correct spelling for the retrieved word; and adding the retrieved word and its correct spelling to the list so that the retrieved word can automatically be corrected when retrieved from another document.
 9. The method of claim 8 includingdetermining whether the retrieved word is in the list as a misspelled word; and when the retrieved word is in the list as a misspelled word, replacing the retrieved word in the document with the associated correctly spelled word from the list.
 10. The method of claim 9 wherein the receiving of the correct spelling for the word and the adding of the retrieved word and its correct spelling to the list occurs when the retrieved word is not in the list as a misspelled word.
 11. The method of claim 8 including replacing the retrieved word with the received correct spelling.
 12. A method in a computer system for correcting the spelling of words, the computer system having a list of misspelled words and associated correctly spelled words, the method comprising:receiving a plurality of words; storing each of the plurality of words in the document;retrieving one of the words from the document; determining whether the retrieved word is in the list as a misspelled word; and when the retrieved word is in the list as a misspelled word, replacing the retrieved word in the document with the correctly spelled word associated with the misspelled word.
 13. The method of claim 12 includingwhen the retrieved word is not in the list as a misspelled word,determining whether the retrieved word is correctly spelled; and when the retrieved word is not correctly spelled,receiving a correct spelling for the word; and adding the retrieved word and its correct spelling to the list so that the word can automatically be corrected when retrieved again.
 14. A computer-readable medium containing instructions for causing a computer system to correct the spelling of words in a plurality of documents, the computer system having a list of misspelled words and associated correctly spelled words, by:for each word in each of the plurality of documents,retrieving the word from the document; determining whether the retrieved word is in the list as a misspelled word; when the retrieved word is not correctly spelled and is not in the list as a misspelled word,receiving from a user a correct spelling for the retrieved word; and adding the misspelled word associated with the received correct spelling for the retrieved word to the list; and when the retrieved word is in the list as a misspelled word, replacing the retrieved word with the associated correct spelling from the list whereby once a misspelled word and received correct spelling is added to the list, the misspelled word is replaced when it is next retrieved.
 15. The computer-readable medium of claim 14 wherein when the retrieved word is not in the list as a misspelled word, determining whether the received word is correctly spelled and receiving the correct spelling from the user only when the received word is not correctly spelled.
 16. The computer-readable medium of claim 14 wherein the adding of the misspelled word associated with the received correct spelling for the misspelled word to the list occurs only in response to a indication from the user to add the retrieved word to the list.
 17. A computer system for maintaining a corrected before file containing misspelled words and associated correctly spelled words, comprising:a document having a plurality of words; a list of correctly spelled words; a find misspelled word unit to determine whether a word retrieved from the document is in the list of correctly spelled words; and a check corrected before file unit that, when the retrieved word is not in the list of correctly spelled words, receives a correct spelling for the word from a user, and adds the retrieved word and its correct spelling to the corrected before file.
 18. The computer system of claim 17 further comprising:a correct spelling unit that replaces the retrieved word of the document with the received correct spelling.
 19. The computer system of claim 17 wherein the check corrected before file unit determines whether the retrieved word is in the corrected before file as a misspelled word before receiving the correct spelling for the word from the user.
 20. The computer system of claim 19 wherein the check corrected before file unit automatically replaces the retrieved word with the associated correct spelling when it is determined that the retrieved word is in the corrected before file as a misspelled word. 